Optimizing Cache Behavior of Ray-Driven Volume Rendering Using Space-Filling Curves
نویسنده
چکیده
of the Thesis Optimizing Cache Behavior of Ray-Driven Volume Rendering Using Space-Filling Curves by Oleg Mishchenko Master of Science in Computer Science Stony Brook University 2006 We study the cache behavior of space-filling curves in the context of volume rendering with raycasting. An efficient bit-oriented algorithm for 3D Hilbert curve traversal is also proposed. We find that data organization along space-filling curves provides an effective means to preserve cache coherency and to reduce expensive cache misses. A surprising result of our study is that the Z curve has better characteristics in conjunction with smaller cache sizes than the theoretically superior Hilbert curve. We tested a wide range of ray traversal models, such as random ray direction changes associated with scattering, bent rays resulting from refractions, and the cache-related effects of interpolation filter size.
منابع مشابه
Optimizing image steganography by combining the GA and ICA
In this study, a novel approach which uses combination of steganography and cryptography for hiding information into digital images as host media is proposed. In the process, secret data is first encrypted using the mono-alphabetic substitution cipher method and then the encrypted secret data is embedded inside an image using an algorithm which combines the random patterns based on Space Fillin...
متن کاملUsing 3-Dimensional Seed Filling in View Space to Accelerate Volume Rendering
This paper presents and evaluates a novel method for projecting a three-dimensional volumetric 6-connected object onto a 2D view using seed filling in the view space. Resampling a 6-connected volume by ray casting produces a new 6-connected volume, provided that the sampling rate is high enough. This new volume can be projected by a 3-dimensional seed filling algorithm. We implement and evaluat...
متن کاملDistributed-Memory 3D Rendering with Object Migration
Object dataflow is a popular approach used in parallel rendering. The data representing the 3D scene is statically distributed among processors and objects are fetched and cached only on demand. Most previous methods were implemented on shared memory architectures and exploited only object-space coherency to reduce cache misses. In this paper, we propose an efficient model for object dataflow o...
متن کاملProgressive CPU Volume Rendering with Sample Accumulation
We present a new method for progressive volume rendering by accumulating object-space samples over successively rendered frames. Existing methods for progressive refinement either use image space methods or average pixels over frames, which can blur features or integrate incorrectly with respect to depth. Our approach stores samples along each ray, accumulates new samples each frame into a buff...
متن کاملCrack-free rendering of dynamically tesselated B-rep models
We propose a versatile pipeline to render B-Rep models interactively, precisely and without rendering-related artifacts such as cracks. Our rendering method is based on dynamic surface evaluation using both tesselation and ray-casting, and direct GPU surface trimming. An initial rendering of the scene is performed using dynamic tesselation. The algorithm we propose reliably detects then fills u...
متن کامل